Convergence of “Best-response Dynamics” in Zero-sum Stochastic Games

نویسندگان

  • David Leslie
  • Steven Perkins
  • Zibo Xu
چکیده

Given a two-player zero-sum discounted-payoff stochastic game, we introduce three classes of continuous-time best-response dynamics, stopping-time best-response dynamics, closed-loop best-response dynamics, and open-loop best-response dynamics. We show the global convergence of the first two classes to the set of minimax strategy profiles, and the convergence of the last class when the players are not patient. We also show that the payoffs in a modified closed-loop bestresponse dynamic converges to the asymptotic value in the zero-sum stochastic game.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Best Response Dynamics for Continuous Zero–sum Games

We study best response dynamics in continuous time for continuous concave-convex zero-sum games and prove convergence of its trajectories to the set of saddle points, thus providing a dynamical proof of the minmax theorem. Consequences for the corresponding discrete time process with small or diminishing step-sizes are established, including convergence of the fictitious play procedure.

متن کامل

Convergent Multiple-timescales Reinforcement Learning Algorithms in Normal Form Games

We consider reinforcement learning algorithms in normal form games. Using two-timescales stochastic approximation, we introduce a modelfree algorithm which is asymptotically equivalent to the smooth fictitious play algorithm, in that both result in asymptotic pseudotrajectories to the flow defined by the smooth best response dynamics. Both of these algorithms are shown to converge almost surely...

متن کامل

Convergent Multiple-times-scales Reinforcement Learning Algorithms in Normal Form Games

We consider reinforcement learning algorithms in normal form games. Using two-time-scales stochastic approximation, we introduce a modelfree algorithm which is asymptotically equivalent to the smooth fictitious play algorithm, in that both result in asymptotic pseudotrajectories to the flow defined by the smooth best response dynamics. Both of these algorithms are shown to converge almost surel...

متن کامل

Approximate Best-Response Dynamics in Random Interference Games

In this paper we develop a novel approach to the convergence of Best-Response Dynamics for the family of interference games. Interference games represent the fundamental resource allocation conflict between users of the radio spectrum. In contrast to congestion games, interference games are generally not potential games. Therefore, proving the convergence of the best-response dynamics to a Nash...

متن کامل

A general model of best response adaptation

We develop a general model of best response adaptation in large populations for symmetric and asymmetric conflicts with role-switching. For special cases including the classical best response dynamics and the symmetrized best response dynamics we show that the set of Nash equilibria is attracting for zero-sum games. For asymmetric conflicts and equally large populations, convergence to a Nash e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015